Probabilistic Cellular Automata for Low-Temperature 2-d Ising Model
نویسندگان
چکیده
منابع مشابه
Low Temperature Expansion for the 3-d Ising Model
We compute the weak coupling expansion for the energy of the three dimensional Ising model through 48 excited bonds. We also compute the magnetization through 40 excited bonds. This was achieved via a recursive enumeration of states of fixed energy on a set of finite lattices. We use a linear combination of lattices with a generalization of helical boundary conditions to eliminate finite volume...
متن کاملAround probabilistic cellular automata
We survey probabilistic cellular automata with approaches coming from combinatorics, statistical physics, and theoretical computer science, each bringing a different viewpoint. Some of the questions studied are specific to a domain, and some others are shared, most notably the ergodicity problem.
متن کاملProbabilistic Cellular Automata
Cellular automata are binary lattices used for modeling complex dynamical systems. The automaton evolves iteratively from one configuration to another, using some local transition rule based on the number of ones in the neighborhood of each cell. With respect to the number of cells allowed to change per iteration, we speak of either synchronous or asynchronous automata. If randomness is involve...
متن کاملA probabilistic cellular automata model for highway traffic simulation
This work presents a probabilistic model for the microscopic simulation of traffic roads based on Nagel-Schreckenberg’s model. Each driver’s behavior is described through the combination of a continuous probability function with an anticipatory feature that leads to a counter flow velocity tunning. The simulations developed and described herein give rise to a phase diagram which resembles and e...
متن کاملProbabilistic cellular automata model for reaction diffusion systems
Class of cellular automata (CA) for modeling reaction diffusion systems has been presented. The construction of the CA is general enough to be applicable to large class of reaction diffusion equation s. Tne automata are based on running average procedure and on probabilistic table look up to implement diffusion reactions. The evolution of probabilistic CA simulates a spatially distributed proce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2016
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-016-1661-2